Decentralized exchanges in a distributed autonomous platform

ABSTRACT

Disclosed embodiments include a server included in a network. The server is operable to determine a next block signer in a blockchain. The server includes processor(s) and memory containing instructions executable by the processor(s). As such, the server is operable to receive bids from nodes of the network and to select a bid from the received bids. The selected bid is provided by a node from the nodes of the network. The server is further operable to grant a right to sign a next block in a blockchain to the node that provided the selected bid.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional PatentApplication No. 62/325,647, filed on Apr. 21, 2016, and claims thebenefit of U.S. Provisional Patent Application No. 62/325,637, filed onApr. 21, 2016, and claims the benefit of U.S. Provisional PatentApplication No. 62/325,607, filed on Apr. 21, 2016, and the subjectmatter thereof is incorporated hereby by reference in their entireties.

TECHNICAL FIELD

The disclosed teachings relate generally to a distributed autonomousplatform. More particularly, the disclosed teachings relate todecentralized exchanges in a distributed autonomous platform.

BACKGROUND

Distributed computing has emerged as a promising solution to theinherent drawbacks of standalone computing. Bitcoin is an example of adistributed autonomous cryptocurrency system that provides a pragmaticengineered solution for arriving at a consensus in the face of trust andtiming problems encountered in distributed networks. Decentralizedexchanges for trading securities can also be implemented in adistributed network. Such exchanges can only support securities of asize too small to be practical compared to conventional centralizedexchanges. As such, centralized exchanges remain the only practicalmeans for trading securities.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a distributed computer network according tosome embodiments of the present disclosure;

FIG. 2 is a flowchart showing a process performed by a server in anetwork implementing a decentralized exchange according to someembodiments of the present disclosure;

FIG. 3 is a flowchart showing a process performed by a server in anetwork for determining a next block signer of a blockchain according tosome embodiments of the present disclosure; and

FIG. 4 is a block diagram of a computer operable to implement thedisclosed technology according to some embodiments of the presentdisclosure.

DETAILED DESCRIPTION

The embodiments set forth below represent the necessary information toenable those skilled in the art to practice the embodiments, andillustrate the best mode of practicing the embodiments. Upon reading thefollowing description in light of the accompanying figures, thoseskilled in the art will understand the concepts of the disclosure andwill recognize applications of these concepts that are not particularlyaddressed herein. It should be understood that these concepts andapplications fall within the scope of the disclosure and theaccompanying claims.

The purpose of terminology used herein is only for describingembodiments and is not intended to limit the scope of the disclosure.Where context permits, words using the singular or plural form may alsoinclude the plural or singular form, respectively.

As used herein, unless specifically stated otherwise, terms such as“processing,” “computing,” “calculating,” “determining,” “displaying,”“generating” or the like, refer to actions and processes of a computeror similar electronic computing device that manipulates and transformsdata represented as physical (electronic) quantities within thecomputer's memory or registers into other data similarly represented asphysical quantities within the computer's memory, registers, or othersuch storage medium, transmission, or display devices.

As used herein, the terms “connected,” “coupled,” or variants thereof,refer to any connection or coupling, either direct or indirect, betweentwo or more elements. The coupling or connection between the elementscan be physical, logical, or a combination thereof.

Existing distributed exchanges lack a centralized exchange that includesa single matching engine that clears all orders. Instead, each node ofthe network has its own copy of a matching engine. Each matching enginekeeps track of all orders in structures known as “market-depth” and/or“limit-order-book.” A depth of market measure provides an indication ofthe liquidity and depth for that security or currency. Alimit-order-book provides a guarantee that the top priority order isexecuted before other orders in the book, and before other orders atequal or worse price held or submitted by other traders.

When a match occurs, orders are marked as filled, and both sides of thetrades have their positions changed. However, problems associated withblockchain-based decentralized exchanges include every node havingtransactions recorded in a different order due to the asynchronousnature of the distributed network. The true order of events is knownonly after the transactions are inside a block. Further, traders neverknow their true positions until after the next block. That is, tradersknow their positions when their own nodes show that their orders werematched and filled; however, this may not occur when the orders of atransaction change in the next block. Moreover, traders are incentivizedto fork a chain of a blockchain during major market moves if theircurrent order of transactions is a particularly bad trade and they wouldincur a large trading loss as a result. The disclosed embodimentsovercome these drawbacks.

The disclosed embodiments include a decentralized exchange implementedin a blockchain. The embodiments include mechanisms for overcomingexisting problems of trust and timing with distributed exchanges.Solutions include a centralized server that timestamps all orders andbroadcasts the timestamped orders to the nodes of the network. Each nodemaintains a matching engine to place and fill any orders but relies onthe timestamping from the centralized server to validate an ordering oftransactions.

In some embodiments, the decentralized exchange may implement a“GammaCoin” blockchain that avoids the need for without centralizedtimestamping. The disclosed technology includes a bidding process usedto select a next block signer. Specifically, nodes (of marketparticipants) bid to sign blocks of the blockchain. The right to sign ablock may be given to the highest bidder. A bid may be determined basedon a variety of factors and considerations. For example, each node cancalculate a best/worst order of events and bid accordingly. A node maybe willing to pay up to an amount to avoid loss and/or ensure profits.Other considerations may include desired positions and market liquidity.New trading strategies can emerge based on the knowledge thatparticipants can pay to change the order of a limit-order-book. Thesestrategies can replace high-frequency trading strategies of centralizedexchanges.

FIG. 1 illustrates a system 10 that includes a network 14 ofinterconnected nodes 12 according to some embodiments of the presentdisclosure. Embodiments of the distributed autonomous platform may beincluded in one or more of the nodes 12. As such, the network 14 canperform processes of a blockchain-based decentralized exchange. Thenetwork 14 may include a combination of private, public, wired, orwireless portions. Data communicated over the network 14 may beencrypted or unencrypted at various locations or portions of the network14. Each node 12 may include combinations of hardware and/or software toprocess data, perform functions, communicate over the network 14, andthe like.

Nodes 12 may include computing devices such as servers, desktop orlaptop computers (e.g., APPLE MACBOOK, LENOVO 440), handheld mobiledevices (e.g., APPLE (PHONE, SAMSUNG GALAXY, MICROSOFT SURFACE), and anyother electronic computing device. Any component of the network 14 mayinclude a processor, memory or storage, a network transceiver, adisplay, operating system and application software (e.g., for providinga user interface), and the like. Other components, hardware, and/orsoftware included in the network 14 that are well known to personsskilled in the art are not shown or discussed herein for brevity.

The network 14 may utilize public-key cryptography to securely processtransactions over the network 14. Public-key cryptography usesasymmetric key algorithms, where a key used by one party to performeither encryption or decryption is not the same as the key used byanother in the counterpart operation. Each party has a pair ofcryptographic keys: a public encryption key and a private decryptionkey. For example, a key pair used for digital signatures consists of aprivate signing key and a public verification key. The public key may bewidely distributed, while the private key is known only to itsproprietor. The keys are related mathematically, but the parameters arechosen so that calculating the private key from the public key isunfeasible. Moreover, the keys could be expressed in various formats,including hexadecimal format.

The disclosed decentralized exchange is described in the context of agaming platform merely to aid in understanding. Gaming inherentlyinvolves unpredictable events and outcomes. For example, someparticipants of a game may have successfully projected outcomes thatdefied expectations of most participants. The disclosed platform equatessuccessful projections and skill. For example, participants of fantasyfootball play by drafting a team and then submitting a lineup each week.Some leagues allow trading players, but the high-stakes public leaguesdo not. There can also be weekly games and a professional expert serviceindustry that supports the gaming environment. These decisions involvemaking projections of events and outcomes of games.

The disclosed embodiments relate to distributed blockchain matchingengines. In the context of using gaming tokens, there is a full futuresmarket on each NFL player's weekly results. Blockchain participants canbuy and sell futures contracts, using gaming tokens as the currency forsettlement and profit and loss.

The gaming platform enables buying or selling a player's seasonproduction with gaming tokens. For example, the platform enables buyingor selling futures contracts on NFL player performance. If a participantwants to “sell” a fantasy player in existing gaming environments, theparticipant could (a) trade the player (if owned), (b) not draft theplayer, (c) blog or tweet about the player, and/or (d) not pick theplayer in weekly games.

Projections about the outcome of a game (i.e., “level 1” projections)can be made up until the game commences. For example, during each weekof the fantasy season, up until kickoff, projections can be made. Allthat is needed to make projections is a valid name identifier for theparticipant. Projections can be made by signing a pointProjection eventand sending it to the network of the gaming platform. Every timelyprojection included in the blockchain is eligible for a payout. Once ablock containing the consensus results is received, a deterministicdistribution algorithm is run to determine the payouts to eachparticipant.

A distribution algorithm can be used to determine payouts to eachparticipant according to some embodiments of the present disclosure. Thedistribution algorithm can also be expressed mathematically. Let R equalactual results of a game and let p_(n) equal projections made by eachparticipant n. The difference between results and projections isd(p)=|R−p|. The average difference is D=Σ_(n)|R−p_(n)|.

Projections below average or 100% or more off a mark are filtered out,as

${F(d)} = \left\{ {\begin{matrix}0 & {{{if}\mspace{14mu} d} > {\overset{\_}{D}\mspace{14mu} {or}\mspace{14mu} d} > r} \\1 & {otherwise}\end{matrix}.} \right.$

A unit payout X distributes more gaming tokens for better predictions as

$X = {\frac{R}{\left( {R - {d\left( p_{n} \right)}} \right){F\left( {d\left( p_{n} \right)} \right)}}.}$

Lastly, an award function A(p) determines how many gaming points areawarded for each projection, which can be multiplied by a factor such as100 for gaming tokens. The award function can be expressed asA(p)=X×(R−d(p))×F(d(p)). Any leftover points, L, due to poor projectionsor no projections can be distributed to a block signer, whereL=R−Σ_(n)A(p_(n)).

A proof-of-work may be required in order for a participant to obtain aname identifier (e.g., fantasy name), which mitigates the vulnerabilityof the gaming platform to a Sybil attack. Otherwise there would be nocost to making projections. As such, an attacker could write a programto create millions of participant identifiers in an attempt to controlthe gaming platform of the network.

The gaming platform may include different ways to keep score (e.g.,number of gaming tokens) and participant rankings. The values of scoresand participant rankings can be used to determine signers of nextblocks. The values could be kept based on skill, data, stake, and time.Skill refers to a gross total of gaming tokens earned, which can onlyincrease and are not transferrable. Data refers to data feed rankings,which cannot be less than skill and can be assigned to an agent. Stakerefers to a net balance of present gaming tokens that is nottransferrable. Time refers to time-sync rankings, which cannot be lessthan the stake and can be assigned to an agent. In the context offutures exchanges, stake balance is the currency used for trading,margin, and settlement. The time-balances let a user participate incentralized time stamping operations.

In some embodiments, each participant identifier may assign a peer to bean agent of data and time. The skill and stake values of the assignercan be added to the data and time rankings of the agent, respectively.If a participant identifier assigns herself as her own agent, shebecomes a volunteer and must be willing to do the same for the entirenetwork of the gaming platform. By default, agents are assigned bydefault consensus, the agents being decided by skill and stake consensusproofs.

If a single agent represents a majority of the network, that agent canbecome an oracle, and a central point of control for critical timeperiods, such as during live games. As such, agents are essentiallyparticipants appointed by a consensus of the network. Free marketeconomic forces would choose the most capable agents.

The disclosed gaming platform includes a state machine. In particular,the underlying protocol can change its behavior based on its currentstate. There are also different blockchain and event or transactionrules. A transition to a different state is accomplished when a block ofa blockchain is signed. The particular proof required to sign a blockalso depends on a transition context.

The gaming platform may include a variety of event types. A transactionthat transfers gaming tokens is only one of many event types. Incontrast to Bitcoin, the transfer transaction is not necessarily a corefeature of the disclosed gaming platform. Instead, for example, pointprojections and name identifier mining can be core features of thegaming platform.

Examples of events, in order of significance, include:

-   -   nameProof: contains proof-of-work data sent by new participants        to claim their identifiers, and is signed by an/the identifier;    -   pointProjection: contains the playerID, week, and point        projection, and is sent and signed by an/the identifier;    -   dataTransition: contains game results, draft results, player        metadata or schedule data, is sent by a data agent, and is        signed by consensus of skill;    -   timeTransition: contains trading session, exchange events, or        any time-ordered data, is sent by a time agent, and is signed by        consensus of stake;    -   exchangeOrder: contains limit order, price, quantity, playerID.        The exchangeOrder is first created and signed by fantasy name,        then stamped and signed by time agent; and    -   transferTransaction: contains the amount to transfer and the        sender and receiver fantasy names, and is signed by sender.

The gaming platform may include deterministic transactions. A statetransition event can trigger multiple events and transactions. Examplesof transactions include:

-   -   coinbaseTransaction: awards new gaming tokens based on the        aforementioned distribution algorithm. Further, this transaction        can be triggered by a dataTransition “WeekOver” event;    -   exchangeExecution: contains fills and order status, generated by        an internal matching-engine, triggered by timeTransition        “TradeOpen” and followed by multiple exchangeOrder events; and    -   clearingTransaction: contains transferTransaction events,        generated by an internal engine, triggered by a timeTransition        “TradeClose” and followed by multiple exchangeExecutions.

Embodiments include crypto tokens (“BergStake”) that represent a rightto sign blocks in blockchains. BergStake includes hashes from a staticand limited resource that are known to all nodes of the network, areperpetually attached to particular public keys, and can be lost fromdouble mining. For example, a “slasher” algorithm could be implementedsuch that proof-of-double-mining will cause users to lose theirBergStake.

BergStake is a generalization of proof-of-skill. For example, even whena user spends all his or her gaming tokens, the skill remains with theuser and is used for signing blocks in the proof-of-skill blockchain. Aprivate-key holder can receive BergStake proportional to tokens createdby proof-of-work, pre-mine, or gaming points. BergStake remains with theprivate-key holder even if the new tokens are transferred away. However,BergStake can be transferred as an inheritance, for example, byproviding the original private key. Thus, BergStake is a distributedconsensus mechanism alternative to proof-of-work mining and solves knownissues of proof-of-stake blockchains.

Since BergStake is limited and can be lost, there is in fact somethingat stake to deter double mining. Losing BergStake is enabled byproof-of-double-mining, which results because BergStake blockchains haveknowledge of alternative forks. The proof-of-double-mining can destroyBergStake and its recent block reward. Hence, the risk of losingBergStake and new tokens incentivizes mining only the valid chain of afork. This feature overcomes the “nothing-at-stake” flaw inproof-of-stake blockchains.

Since all BergStakers (i.e., owners of BergStake) are known in advance,the block-signer selection algorithm can mitigate stake grinding. Forexample, the hash of the previous two signers can be used to select thenext signer. Another technique may involve choosing the next n signersbased on the current signer and a pseudorandom number.

In some embodiments, BergStake can be used in a hybrid approach todetermine signers. For example, a network can use a proof-of-workblockchain for an initial period of time, and then switch to aproof-of-stake blockchain. In the proof-of-work phase, miners canreceive BergStake in addition to tokens as a reward for signing a block.A BergStake would represent the right to sign future blocks during theproof-of-stake phase. Once all tokens have been distributed, BergStakerswill be rewarded with transaction fees only. As such, BergStake can bethought of as a virtual perpetual mining rig. The virtual rig is builtby miners during the proof-of-work phase as they sign blocks. Those sameminers can then “turn on” their BergStake virtual mining rigs tocontinue signing blocks in the proof-of-stake phase.

As indicated above, the disclosed technology could be implemented in adecentralized exchange. A pure decentralized exchange can be asunattainable as solving the general problems of trust and timing.Exchange limit-order-books are path dependent. As such, the time andorder of events matter. In a pure decentralized distributed order book,all peers will have a different market snapshot. So, for a trader, thereis no way to know the real status of his or her orders, or position,until after a block is signed. Moreover, if there were a majorcapitulation move followed by a snapback in price, block signers wouldbe incentivized to front-run, and losers to attempt to extend forks.

The disclosed platform solves these drawbacks with proof-of-timeprovided by a centralized time-synching mechanism. Specifically, aproof-of-time consensus engine chooses a centralized time-syncing agent(e.g., a timestamping server). In some embodiments, the time-syncingagent signs each timestamp with 51% of total stake outstanding. In someembodiments, all orders (e.g., exchangeOrder events) are timestamped bythe designated time-syncing agent. The timestamped orders are thenbroadcast back to the network.

The disclosed platform maintains a distributed matching mechanism. Afault-tolerant, centralized matching engine is not required forprocessing orders and broadcasting fills and market data. Instead, thematching engines remain distributed at each node of the network, andeach node has a copy of market values, including the time stamps. Thisequal distribution enables deterministic exchangeExecutions andclearingTransactions. Trading sessions are opened and closed bytimeTransitions events and proof-of-time consensus.

FIG. 2 is a flowchart showing a process 200 performed by a server in anetwork implementing a decentralized exchange according to someembodiments of the present disclosure. In step 202, the server receivesa plurality of orders from a plurality of nodes collectivelyimplementing a decentralized exchange. In step 204, the serverassociates a time value to each of the plurality of orders, therebyproviding a corresponding plurality of time-stamped orders. In step 206,the server distributes information indicative of each of the time valuesof the time-stamped orders to the plurality of nodes of the network.

In some embodiments, the disclosed platform may implement a “GammaCoin”blockchain that avoids the need for time-stamping. Specifically, abidding process among the distributed nodes of the network determinesthe next block signer. More specifically, nodes of the network pay tosign blocks.

In some embodiments, the highest bidder is given the right to signblocks. Bids can be issued by nodes (e.g., vis-à-vis market participantssuch as traders). The value of a bid can be determined based on avariety of factors and considerations. For example, a bid could bedetermined by calculating a best and worst order of events. To obtainthe right to sign a block, a node/trader may pay up to the amount of hisor her losses (i.e., to avoid the loss) or pay up to an amount of profit(i.e., to ensure the profit). Examples of other considerations used todetermine a bid include desired positions and market liquidity.

As a result, new trading strategies can emerge based on the knowledgethat any of the participants of the decentralized exchange can pay tochange the order of the limit-order-book. These strategies may replacehigh-frequency trading strategies common in centralized exchanges. Insome embodiments, the decentralized exchange could be regulated byprivate or public agencies such as the U.S. Commodity Futures TradingCommission (CFTC).

For example, FIG. 3 is a flowchart showing a process 300 performed by aserver in a network for determining a next block signer of a blockchainaccording to some embodiments of the present disclosure. In step 302, aserver receives bids from nodes of the network. In step 304, the serverselects a bid from the received bids. The selected bid was provided by anode from the nodes of the network. In step 306, the server grants aright to sign a next block in a blockchain to the node that provided theselected bid.

FIG. 4 is a block diagram of a computer 20 of system 10 operable toimplement the disclosed technology according to some embodiments of thepresent disclosure. The computer 20 may be a generic computer orspecifically designed to carry out features of system 10. For example,the computer 20 may be a system-on-chip (SOC), a single-board computer(SBC) system, a desktop or laptop computer, a kiosk, a mainframe, a meshof computer systems, a handheld mobile device, or combinations thereof.

The computer 20 may be a standalone device or part of a distributedsystem that spans multiple networks, locations, machines, orcombinations thereof. In some embodiments, the computer 20 operates as aserver computer (e.g., node 12) or a client device in a client-servernetwork environment, or as a peer machine in a peer-to-peer system. Insome embodiments, the computer 20 may perform one or more steps of thedisclosed embodiments in real time, in near real time, offline, by batchprocessing, or combinations thereof.

As shown, the computer 20 includes a bus 22 operable to transfer databetween hardware components. These components include a control 24(i.e., processing system), a network interface 26, an Input/Output (I/O)system 28, and a clock system 30. The computer 20 may include othercomponents not shown or further discussed for the sake of brevity. Onehaving ordinary skill in the art will understand any hardware andsoftware included but not shown in FIG. 4.

The control 24 includes one or more processors 32 (e.g., CentralProcessing Units (CPUs), Application Specific Integrated Circuits(ASICs), and/or Field Programmable Gate Arrays (FPGAs)) and memory 34(which may include software 36). The memory 34 may include, for example,volatile memory such as random-access memory (RAM) and/or non-volatilememory such as read-only memory (ROM). The memory 34 can be local,remote, or distributed.

A software program (e.g., software 36), when referred to as “implementedin a computer-readable storage medium,” includes computer-readableinstructions stored in a memory (e.g., memory 34). A processor (e.g.,processor 32) is “configured to execute a software program” when atleast one value associated with the software program is stored in aregister that is readable by the processor. In some embodiments,routines executed to implement the disclosed embodiments may beimplemented as part of operating system (OS) software (e.g., MicrosoftWindows®, Linux®) or a specific software application, component,program, object, module or sequence of instructions referred to as“computer programs.”

As such, the computer programs typically comprise one or moreinstructions set at various times in various memory devices of acomputer (e.g., computer 20) and which, when read and executed by atleast one processor (e.g., processor 32), cause the computer to performoperations to execute features involving the various aspects of thedisclosed embodiments. In some embodiments, a carrier containing theaforementioned computer program product is provided. The carrier is oneof an electronic signal, an optical signal, a radio signal, or anon-transitory computer-readable storage medium (e.g., the memory 34).

The network interface 26 may include a modem or other interfaces (notshown) for coupling the computer 20 to other computers over the network18. The I/O system 28 may operate to control various I/O devices,including peripheral devices such as a display system 38 (e.g., amonitor or touch-sensitive display) and one or more input devices 40(e.g., a keyboard and/or pointing device). Other I/O devices 42 mayinclude, for example, a disk drive, printer, scanner, or the like.Lastly, the clock system 30 controls a timer for use by the disclosedembodiments.

Operation of a memory device (e.g., memory 34), such as a change instate from a binary one to a binary zero (or vice versa) may comprise avisually perceptible physical transformation. The transformation maycomprise a physical transformation of an article to a different state orthing. For example, a change in state may involve accumulation andstorage of charge or release of stored charge. Likewise, a change ofstate may comprise a physical change or transformation in magneticorientation, or a physical change or transformation in molecularstructure, such as from crystalline to amorphous or vice versa.

Aspects of the disclosed embodiments may be described in terms ofalgorithms and symbolic representations of operations on data bitsstored on memory. These algorithmic descriptions and symbolicrepresentations generally include a sequence of operations leading to adesired result. The operations require physical manipulations ofphysical quantities. Usually, though not necessarily, these quantitiestake the form of electrical or magnetic signals capable of being stored,transferred, combined, compared, and otherwise manipulated. Customarily,and for convenience, these signals are referred to as bits, values,elements, symbols, characters, terms, numbers, or the like. These andsimilar terms are associated with physical quantities and are merelyconvenient labels applied to these quantities.

While embodiments have been described in the context of fullyfunctioning computers, those skilled in the art will appreciate that thevarious embodiments are capable of being distributed as a programproduct in a variety of forms and that the disclosure applies equallyregardless of the particular type of machine or computer-readable mediaused to actually effect the embodiments.

While the disclosure has been described in terms of several embodiments,those skilled in the art will recognize that the disclosure is notlimited to the embodiments described herein and can be practiced withmodifications and alterations within the spirit and scope of theinvention. Those skilled in the art will also recognize improvements tothe embodiments of the present disclosure. All such improvements areconsidered within the scope of the concepts disclosed herein. Thus, thedescription is to be regarded as illustrative instead of limiting.

1. A server computer included in a network, the server computer beingoperable to determine a next block signer in a blockchain, the servercomputer comprising: one or more processors; and memory containinginstructions executable by the one or more processors whereby the servercomputer is operable to: receive a plurality of bids from a plurality ofnodes of the network; select a bid from the plurality of bids, theselected bid being provided by a node from the plurality of nodes of thenetwork; and grant a right to sign a next block in a blockchain to thenode that provided the selected bid.
 2. The server computer of claim 1,wherein each of the plurality of bids has a corresponding value, and thevalue of the selected bid is greater compared to the values of the otherbids of the plurality of bids.
 3. The server computer of claim 1,wherein the network of nodes implements a decentralized exchange.
 4. Theserver computer of claim 3, wherein each of the plurality of bids has acorresponding value, and the value of each bid is based on a predictedorder of events occurring in the decentralized exchange.
 5. A methodperformed by a server computer included in a network to determine a nextblock signer in a blockchain, the method comprising: receiving aplurality of bids from a plurality of nodes of the network; selecting abid from the plurality of bids, the selected bid being provided by anode from the plurality of nodes of the network; and granting a right tosign a next block in a blockchain to the node that provided the selectedbid.
 6. The method of claim 5, wherein each of the plurality of bids hasa corresponding value, and the value of the selected bid is greatercompared to the values of the other bids of the plurality of bids. 7.The method of claim 5, wherein the network of nodes implements adecentralized exchange.
 8. The method of claim 7, wherein each of theplurality of bids has a corresponding value, and the value of each bidis based on a predicted order of events occurring in the decentralizedexchange.
 9. A server computer included in a network, the servercomputer comprising: one or more processors; and memory containinginstructions executable by the one or more processors whereby the servercomputer is operable to: receive a plurality of orders from a pluralityof nodes collectively implementing a decentralized exchange; associate atime value to each of the plurality of orders thereby providing acorresponding plurality of time-stamped orders; and distributeinformation indicative of each of the time values of the time-stampedorders to the plurality of nodes of the network.
 10. A method performedby a server computer included in a network implementing a decentralizedexchange, the method comprising: receiving a plurality of orders from aplurality of nodes collectively implementing a decentralized exchange;associating a time value to each of the plurality of orders therebyproviding a corresponding plurality of time-stamped orders; anddistributing information indicative of each of the time values of thetime-stamped orders to the plurality of nodes of the network.